算法--Two sum之排序数字二分查找实现

最新推荐文章于 2021-09-20 17:06:40 发布

寻梦梦飞扬

最新推荐文章于 2021-09-20 17:06:40 发布

阅读量752

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/weixin_41043240/article/details/79440040

版权

本文探讨如何利用排序和二分查找算法解决Two Sum问题，分别提供了Python和C语言的实现代码示例。

摘要由CSDN通过智能技术生成

python

def findTwoSumSorted(inputList, sumOfTwo, start, end):
    """
    find two number in the inputList, which the sum is sumOfTwo, 
    the inputList is sorted

    inputList: a list of number
    sumOfTwo: a number

    return: list of two index
    """
    result = [-1, -1]

    while (start + 1 < end):
        mid = int((start + end)/2)
        print("start is:", start, "end is:", end, "mid is:", mid)

        if (inputList[start] + inputList[end]) > sumOfTwo:
            if (inputList[start] + inputList[mid] > sumOfTwo):
                end = mid - 1
            elif (inputList[start] + inputList[mid] < sumOfTwo):
                end = end -1
            else:
                result[0] = start
                result[1] = mid
                print("find two: ",result[0], result[1])
                return result
        elif (inputList[start] + inputList[end]) < sumOfTwo:   
            if (inputList[mid] + inputList[end